Compiling Parallel Sparse Code for User-Defined Data Structures
نویسندگان
چکیده
We describe how various sparse matrix and distribution formats can be handled using the relational approach to sparse matrix code compilation. This approach allows for the development of compilation techniques that are independent of the storage formats by viewing the data structures as relations and abstracting the implementation details as access methods.
منابع مشابه
Compiling Parallel Sparse Code for User � De ned Data
We describe how various sparse matrix and distribution formats can be handled using the relational approach to sparse matrix code compilation This approach allows for the development of compilation techniques that are independent of the storage formats by viewing the data structures as relations and abstracting the implementation details as access methods Introduction Sparse matrix computations...
متن کاملCompiling Data - Parallel Paradigms through
This paper presents a compiling technique to generate parallel code with explicit local communications for a mesh-connected distributed memory, MIMD architecture. Our compiling technique works for the geometric paradigm of parallel computation, i.e. a data-parallel paradigm where array data structures are partitioned and assigned to a set of processing nodes, which, to perform their identical t...
متن کاملCompiling Geometric Paradigms through Local Communications
This paper presents a compiling technique to generate parallel code with explicit local communications for a mesh-connected distributed memory, MIMD architecture. Our compiling technique works for the geometric paradigm of parallel computation, i.e. a data-parallel paradigm where array data structures are partitioned and assigned to a set of processing nodes, which, to perform their identical t...
متن کاملExpressing Massively Parallel Algorithms for Irregular Data Expressing Massively Parallel Algorithms for Irregular Data
In this paper we present a data-parallel language called MPL, for which the basic data structure is the graph. The purpose of this language is to program numerical algorithms that use irregular data, and to allow them to execute on distributed memory MIMD machines. We deene the graph data structure and give some examples of how irregular data structures can be described from graphs with our app...
متن کاملCompiling Irregular Accesses for the Cell Broadband Engine
A class of scientific problems represents a physical system in the form of sparse and irregular kernels. Parallelizing scientific applications that comprise of sparse data structures on the Cell Broadband Engine (Cell BE) is a challenging problem as the memory access pattern is irregular and cannot be determined at compile time. In this paper we present a compiler framework for the Cell BE that...
متن کامل